Global smooth solution curves using rigorous branch following
نویسندگان
چکیده
In this paper, we present a new method to rigorously compute smooth branches of zeros of nonlinear operators f : R1 × B1 → R2 × B2, where B1 and B2 are Banach spaces. The method is first introduced for parameter continuation and then generalized to pseudo-arclength continuation. Examples in the context of ordinary, partial and delay differential equations are given.
منابع مشابه
Rigorous computation of smooth branches of equilibria for the three dimensional Cahn-Hilliard equation
In this paper, we propose a new general method to compute rigorously global smooth branches of equilibria of higher-dimensional partial differential equations. The theoretical framework is based on a combination of the theory introduced in Global smooth solution curves using rigorous branch following [2] and in Analytic estimates and rigorous continuation for equilibria of higher-dimensional PD...
متن کاملInterval computations, rigour and non-rigour in deterministic continuous global optimization
Deterministic branch and bound methods for the solution of general nonlinear programs have become increasingly popular during the last decade or two, with increasing computer speed, algorithmic improvements, and multiprocessors. There are presently several commercial packages. Although such packages are based on exhaustive search, not all of them rigorously take account of roundoff error, singu...
متن کاملGlobal solution of semi-infinite programs
A branch-and-bound procedure for the global solution of smooth, nonlinear SIPs has been developed. An upper-bounding problem is constructed using an inclusionconstrained reformulation of the infinite set of constraints, and a convex lowerbounding problem is derived from a discretized approximation of the SIP. Results are provided for a number of problems in the SIP literature.
متن کاملOn rigorous upper bounds to a global optimum
In branch and bound algorithms in constrained global optimization, a sharp upper bound on the global optimum is important for the overall efficiency of the branch and bound process. Software to find local optimizers, using floating point arithmetic, often computes an approximately feasible point close to an actual global optimizer. Not mathematically rigorous algorithms can simply evaluate the ...
متن کاملOn Solving Mixed-Integer Constraint Satisfaction Problems with Unbounded Variables
Many mixed-integer constraint satisfaction problems and global optimization problems contain some variables with unbounded domains. Their solution by branch and bound methods to global optimality poses special challenges as the search region is infinitely extended. Many usually strong bounding methods lose their efficiency or fail altogether when infinite domains are involved. Most implemented ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 79 شماره
صفحات -
تاریخ انتشار 2010